Heuristic algorithms and learning techniques: applications to the graph coloring problem
نویسندگان
چکیده
منابع مشابه
Algorithmes Heuristiques et Techniques d'Apprentissage : Applications au Problème de Coloration de Graphe. (Heuristic Algorithms And Learning Techniques : Applications to the Graph Coloring Problem)
The last couple of decades have seen a surge of interest and sophistication in us-ing heuristics to solve combinatorial optimization problems. However, the theoretical andpractical research of these algorithms show there are many important challenges yet tobe overcome – e.g. it seems that it is quite difficult to make a heuristic integrate a globalvision over its own evolution o...
متن کاملExact and Heuristic Algorithms for the Partition Coloring Problem
We study the Partition Coloring Problem (PCP), a generalization of the Vertex Coloring Problem where the vertex set is partitioned. The PCP asks to select one vertex for each subset of the partition in such a way that the chromatic number of the induced graph is minimum. We propose a new Integer Linear Programming formulation with an exponential number of variables. To solve this formulation to...
متن کاملComplete and Incomplete Algorithms for the Queen Graph Coloring Problem
The queen graph coloring problem consists in covering a n × n chessboard with n queens, so that two queens of the same color cannot attack each other. When the size, n, of the chessboard is a multiple of 2 or 3, it is hard to color the queen graph with only n colors. We have developed an exact algorithm which is able to solve exhaustively this problem for dimensions up to n = 12 and find one so...
متن کاملA Parallel Graph Coloring Heuristic
The problem of computing good graph colorings arises in many diverse applications , such as in the estimation of sparse Jacobians and in the development of eecient, parallel iterative methods for solving sparse linear systems. In this paper we present an asynchronous graph coloring heuristic well suited to distributed memory parallel computers. We present experimental results obtained on an Int...
متن کاملA Graph Coloring Problem with Applications to Data Compression
We study properties of graph colorings that minimize the quantity of color information with respect to a given probability distribution P on the vertices of the graph. The minimum entropy of any coloring of such a probabilistic graph (G,P ) is the chromatic entropy Hχ(G,P ). Applications of the chromatic entropy are found in data compression with side information at the receiver and digital ima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2011
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-011-0193-5